Maximum Size Matchings and Input Queued Switches
نویسندگان
چکیده
Simulation results suggest that a maximum size matching (MSM) algorithm will lead to 100% throughput for uniform Bernoulli i.i.d traffic. Previous analysis on the throughput of MSM algorithms enforce deterministic constraints on the joint arrival traffic. In this paper we explore MSM algorithms under Bernoulli arrivals. We show that when the arrival traffic is admissible and cells are scheduled in batches, a sub-class of MSMs called the Critical Maximum Size Matching achieves 100% throughput under (uniform and nonuniform) Bernoulli i.i.d arrivals. Further, we show that — with batch scheduling — all MSMs achieve 100% throughput under Bernoulli i.i.d. uniform load.
منابع مشابه
Packet Scheduling in Input-Queued Cell-Based Switches
Input-queued switch architectures play a major role in the design of high performance switches and routers for packet networks. These architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for input-queued cell switches, operating on fixed-size data u...
متن کاملStable local scheduling policies in networks of input-queued switches
Most research on switch architectures and scheduling algorithms has focused on single switches. It is well known that certain scheduling policies that are based on maximum weight matching algorithms guarantee the stability of single switches. However, recent research has shown that most of these scheduling policies do not guarantee the stability of networks of input-queued switches. So far, onl...
متن کاملInput-queued router architectures exploiting cell-based switching fabrics
Input queued and combined input/output-queued architectures have recently come to play a major role in the design of high-performance switches and routers for packet networks. These architectures must be controlled by a packet scheduling algorithm, which solves contentions in the transfer of data units to switch outputs. Several scheduling algorithms were proposed in the literature for switches...
متن کاملBasic Characteristics of FIFO Packet Switches
In this paper we compare characteristics of different FIFO packet switch types. In accordance with our expectations, the best results are obtained by using the output-queued packet switches. The main drawback of these switches is the need for a fast switching fabric. This can be avoided by using the input-queued packet switches, whose performance depends upon individual packet sizes. Characteri...
متن کاملDegree-sequenced matching algorithms for input-queued switches
This paper presents a class of algorithms for scheduling packets in input-queued switches. As opposed to previously known algorithms that focus only on achieving high throughput, these algorithms seek to achieve low average delay without compromising the throughput achieved. Packet scheduling in input-queued switches based on the virtual-output-queued architecture is a bipartite graph matching ...
متن کامل